- constraint relation
- соотношение для ограничений
English-Russian dictionary of computer science. 2015.
constraint relation
Смотреть что такое "constraint relation" в других словарях:
Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… … Wikipedia
Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… … Wikipedia
Object Constraint Language — The Object Constraint Language (OCL) is a declarative language for describing rules that apply to Unified Modeling Language (UML) models developed at IBM and now part of the UML standard. Initially, OCL was only a formal specification language… … Wikipedia
Primal constraint graph — In constraint satisfaction, the primal constraint graph or simply primal graph (also the Gaifman graph) of a constraint satisfaction problem is the graph whose nodes are the variables of the problem and an edge joins a pair of variables if the… … Wikipedia
Dispersion relation — The refraction of a light in a prism is due to dispersion. In physics and electrical engineering, dispersion most often refers to frequency dependent effects in wave propagation. Note, however, that there are several other uses of the word… … Wikipedia
Relational database — A visual diagram showing the relationship between the two tables, as indicated by the arrow A relational database matches data by using common characteristics found within the data set. The resulting groups of data uses the relational model (a… … Wikipedia
AC-3 algorithm — The AC 3 algorithm (short for Arc Consistency Algorithm #3) is one of a series of algorithms used for the solution of constraint satisfaction problems (or CSP s). It was developed by Alan Mackworth in 1977. The earlier AC algorithms are often… … Wikipedia
Info-gap decision theory — is a non probabilistic decision theory that seeks to optimize robustness to failure – or opportuneness for windfall – under severe uncertainty,[1][2] in particular applying sensitivity analysis of the stability radius type[3] to perturbations in… … Wikipedia
Unique key — In relational database design, a unique key can uniquely identify each row in a table, and is closely related to the Superkey concept. A unique key comprises a single column or a set of columns. No two distinct rows in a table can have the same… … Wikipedia
Indifference curve — In microeconomic theory, an indifference curve is a graph showing different bundles of goods, each measured as to quantity, between which a consumer is indifferent. That is, at each point on the curve, the consumer has no preference for one… … Wikipedia
Multivalued dependency — In database theory, multivalued dependency is a full constraint between two sets of attributes in a relation. In contrast to the functional dependency, the multivalued dependency requires that certain tuples be present in a relation. Therefore, a … Wikipedia
